Specialised multidisciplinary team can solve problems of distance

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ants Can Solve Fundamental System Synthesis Problems

Numerous design challenges in system synthesis can be formulated as combinatorial optimization problems. Unfortunately, most of these problems are NP-complete or NP-hard. As fabrication technology improves and transistors become smaller and more numerous, we will continue to rely on design automation techniques to create and use future computing systems. Therefore, there is a substantial need f...

متن کامل

Ants can solve constraint satisfaction problems

In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to use artificial ants to keep track of promising areas of the search space by laying trails of pheromone. This pheromone information is used to guide the search, as a heuristic for choosing values to be assigned to variab...

متن کامل

Can spreadsheet solvers solve demanding optimization problems?

Practicing engineers resort to modular simulators or to algebraic tools such as GAMS or AMPL for performing complex process optimizations. These tools, however, have a signi®cant learning curve unless they have been introduced at the undergraduate level beforehand. In this work we show how the Solver feature of the Excel spreadsheet can be used for the optimization of a fairly complex system, i...

متن کامل

Can quantum computing solve classically unsolvable problems?

T. D. Kieu has claimed that a quantum computing procedure can solve a classically unsolvable problem. Recent work of W. D. Smith has shown that Kieu’s central mathematical claim cannot be sustained. Here, a more general critique is given of Kieu’s proposal and some suggestions are made regarding the Church-Turing thesis. 0. Introduction: In 2001 the physicist Tien D. Kieu announced that a quant...

متن کامل

Can AI planners solve practical problems?

While there has been recent interest in research on planning and reasoning about actions, nearly all research results have been theoretical. We know of no previous examples of a planning system that has made a signi cant impact on a problem of practical importance. One of the primary goals during the development of the SIPE-2 planning system has been the balancing of e ciency with expressivenes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BMJ

سال: 1995

ISSN: 0959-8138,1468-5833

DOI: 10.1136/bmj.311.7017.1431b